منابع مشابه
Linear functional classes over cellular automata
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which conta...
متن کاملOn the ergodic properties of certain additive cellular automata over Zm
In this paper, we investigate some ergodic properties of Z-actions Tp,n generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in Zm.
متن کاملDynamics of finite linear cellular automata over ZN
We investigate the behaviour of linear cellular automata with state space ZN and only finitely many states. After some general comments about linear cellular automata over ZN , the general case is reduced to that of N being the power of a prime. For a prime power modulus, it is proved under fairly general conditions that the period length for “most” orbits increase by a factor of p when the mod...
متن کاملQuasi-Linear Cellular Automata
Simulating a cellular automaton (CA) for t time-steps into the future requires t serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted efficiently, in serial time O(t) or O(log t) in parallel. In this paper, we generalize this by looki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1983
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90033-8